On Polar Grassmann Codes
نویسنده
چکیده
In this note we offer a short summary of the content of the lecture on polar Grassmann codes given at the Indian Intitute of Technology, Mumbai, during the International Conference on Algebraic Geometry and Coding Theory in December 2013. More precisely, we consider the codes arising from the projective system determined by the image ε k (∆k) of the Grassmann embedding ε gr k of an orthogonal Grassmannian ∆k and determine some of their parameters.
منابع مشابه
Line Hermitian Grassmann Codes and their Parameters
In this paper we introduce and study line Hermitian Grassmann codes as those subcodes of the Grassmann codes associated to the $2$-Grassmannian of a Hermitian polar space defined over a finite field of square order. In particular, we determine their parameters and characterize the words of minimum weight.
متن کاملHyperplanes of Hermitian dual polar spaces of rank 3 containing a quad
Let F and F′ be two fields such that F′ is a quadratic Galois extension of F. If |F| ≥ 3, then we provide sufficient conditions for a hyperplane of the Hermitian dual polar space DH(5,F′) to arise from the Grassmann embedding. We use this to give an alternative proof for the fact that all hyperplanes of DH(5, q2), q 6= 2, arise from the Grassmann embedding, and to show that every hyperplane of ...
متن کاملPolar Grassmannians and their Codes
We present a concise description of Orthogonal Polar Grassmann Codes and motivate their relevance. We also describe efficient encoding and decoding algorithms for the case of Line Grassmannians and introduce some open problems.
متن کاملEnumerative Coding for Line Polar Grassmannians
Codes arising from Grassmannians have been widely investigated, both as generalization of Reed–Muller codes and for applications to network coding. Recently we introduced some new codes, arising from Polar Grassmannians, namely the set of all subspaces of a vector space F q which are totally singular with respect to a given non-degenerate quadratic form. The aim of the present paper is to prese...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کامل